On Quiescent Reliable Communication
نویسندگان
چکیده
منابع مشابه
On Quiescent Reliable Communication
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process crashes and lossy links. We first show that it is impossible to solve this problem in asynchronous systems (with no failure detectors). We then show that, among failure detectors that output lists of suspects, the weakes...
متن کاملQuiescent Reliable Communication and Quiescent Consensus in Partitionable Networks
We consider partitionable networks with process crashes and lossy links, and focus on the problems of reliable communication and consensus for such networks. For both problems we seek algorithms that are quiescent, i.e., algorithms that eventually stop sending messages. We first tackle the problem of reliable communication for partitionable networks by extending the results of [ACT97a]. In part...
متن کاملOn the Weakest Failure Detector for Quiescent Reliable Communication
We consider the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process crashes and lossy links, and show that, among failure detectors with bounded output size, P is the weakest one that can be used to solve this problem. Combined with a result in [ACT97], this shows that failure detecto...
متن کاملHeartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process crashes and lossy links. We first show that it is impossible to solve this problem without failure detectors. We then show how to solve it using a new failure detector, called heartbeat. In contrast to previous failure d...
متن کاملUsing the Heartbeat Failure Detector for Quiescent Reliable Communication and Consensus in Partitionable Networks
We consider purtitionuhle networks with process crashes and lossy links, and focus on the problems of reliuhle communicution and consensus for such networks. For both problems we seek algorithms that are quiescent, i.e., algorithms that eventually stop sending messages. We first tackle the problem of reliable communication for partitionable networks by extending the results of Aguilera et al. (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2000
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539798341296